Automatic parallelization of a class of irregular loops for distributed memory systems
نویسندگان
چکیده
منابع مشابه
Run-Time Parallelization of Irregular DOACROSS Loops
Dependencies between iterations of loop structures cannot always be determined at compile-time because they may depend on input data which is known only at run-time. A prime example is a loop accessing an array where the array indices are themselves functions of another array determined only at run-time. To parallelize such loops, it is necessary to perform a run-time analysis. We describe a ne...
متن کاملScalable Automatic Parallelization of Irregular Reductions on Shared Memory Multiprocessors
This paper presents a new parallelization method for reductions of arrays with subscripted subscripts on scal-able shared memory multiprocessors. The mapping of computations is based on grouping reduction loop iterations into sets that are further distributed across processors. Iterations belonging to the same set are chosen in such a way that update diierent entries in the reduction array. Tha...
متن کاملAutomatic parallelization of irregular applications
Parallel computers are present in a variety of ®elds, having reached a high degree of architectural maturity. However, there is still a lack of convenient software support for implementing ecient parallel applications. This is specially true for the class of irregular applications, whose computational constructs hardly ®t current parallel architectures. In fact, contemporary automatic parallel...
متن کاملParallelization of Irregular Out-of-Core Applications for Distributed-Memory Systems
Large scale irregular applications involve data arrays and other data structures that are too large to t in main memory and hence reside on disks; such applications are called out-of-core applications. This paper presents techniques for implementing this kind of applications. In particular we present a design for a runtime system to eeciently support parallel execution of irregular out-of-core ...
متن کاملAutomatic parallelization of canonical loops
This paper presents a compilation technique that performs automatic parallelization of canonical loops. Canonical loops are a pattern observed in many well known algorithms, such as frequent itemsets, K-means and K nearest neighbors. Automatic parallelization allows application developers to focus on the algorithmic details of the problem they are solving, leaving for the compiler the task of g...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: ACM Transactions on Parallel Computing
سال: 2014
ISSN: 2329-4949,2329-4957
DOI: 10.1145/2660251